Existence of almost resolvable directed 5-cycle systems
نویسندگان
چکیده
A directed k-cycle system of order n is a pair ( S, T ), where S is an n-set and T is a collection of arc disjoint directed k-cycles that partition the complete directed graph Kn *. An almost parallel class with deficiency x is a set of directed k-cycles which form a partition of S \ {x}. An almost resolvable directed k-cyclc system is a directed k-cyclc system in which the cycles can be partitioned into almost parallel classes. It is clear that n == 1 (mod k) is a necessary condition for the existence of such a system. It is well known that for k 3 and 4 the necessary condition is also sufficient. In this paper, we shall introduce a special kind of skew Room frames and discuss their constructions. As an application, we show that an almost resolvable directed 5-cycle system of order n exists if and only ifn 1 (mod 5 ).
منابع مشابه
On α-resolvable directed cycle systems for cycle length 4
A directedm-cycle system of order v with index λ, denotedm-DCS(v, λ), is a collection of directed cycles of length m whose directed edges partition the directed edges of λDKv. An m-DCS(v, λ) is α-resolvable if its directed cycles can be partitioned into classes such that each point of the design occurs in precisely α cycles in each class. The necessary conditions for the existence of such a des...
متن کاملResolvable Even-Cycle Systems with a 1-Rotational Automorphism
In this article, necessary and sufficient conditions for the existence of a 1rotationally resolvable even-cycle system of kKv are given, which are eventually for the existence of a resolvable even-cycle system of kKv . # 2003 Wiley Periodicals, Inc. J Combin Designs 11: 394–407, 2003; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/jcd.10058
متن کاملThe directed almost resolvable Hamilton-Waterloo problem
In this paper, a result is proved that provides a general method of attack that can be used to solve the existence problem for partitions of the directed edges of Dn, the complete directed graph on n. vertices into r and n r almost parallel classes of directed cycles of length m1 and m2 respectively in the case where n\ and, ?rl2 &r€ €v€r. Use of this technique is then demonstrated by essential...
متن کاملMore large sets of resolvable MTS and resolvable DTS with odd orders
In this paper, we first give a method to construct large sets of resolvableMendelsohn triple systems of order q+2, where q=6t+1 is a prime power. Then, using a computer, we find solutions for t ∈ T ={35, 38, 46, 47, 48, 51, 56, 60}. Furthermore, by amethodwe introduced, large sets of resolvable directed triple systems with the same orders are obtained too. Finally, by the tripling construction ...
متن کاملResolvability and Monotone Normality
A space X is said to be κ-resolvable (resp. almost κ-resolvable) if it contains κ dense sets that are pairwise disjoint (resp. almost disjoint over the ideal of nowhere dense subsets). X is maximally resolvable iff it is ∆(X)-resolvable, where ∆(X) = min{|G| : G 6= ∅ open}. We show that every crowded monotonically normal (in short: MN) space is ω-resolvable and almost μ-resolvable, where μ = mi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 11 شماره
صفحات -
تاریخ انتشار 1995